Proximity Mining: Finding Proximity using Sensor Data History
نویسندگان
چکیده
Emerging ubiquitous and pervasive computing applications often need to know where things are physically located. To meet this need, many locationsensing systems have been developed, but none of the systems for the indoor environment have been widely adopted. In this paper we propose Proximity Mining, a new approach to build location information by mining sensor data. The Proximity Mining does not use geometric views for location modeling, but automatically discovers symbolic views by mining time series data from sensors which are placed in surroundings. We deal with trend curves representing time series sensor data, and use their topological characteristics to classify locations where the sensors are placed.
منابع مشابه
Application of grey GIS filtration to identify the potential area for cement plants in South Khorasan Province, Eastern Iran
Cement-based materials are fundamental resources used to in construction. The increase in requests for and consumption of cement products, especially in Iran, indicates that more cement plants should be equipped. This study developed a geographical information system using pairwise comparison based on grey numbers to identify potential sites in which to set up cement plants. A group of five exp...
متن کاملDetection of napropamide by microwave resonator sensor using carbon nanotube – polypyrrole- chitosan layer
This paper presents the design and fabrication of proximity coupled feed disk resonator coated with Multi Walled Carbon Nanotubes (MWCNTs) and Polypyrrole-Chitosan (PPy-CHI) layers as a napropamide sensor. Computer Simulation Technology (CST) microwave studio was used to obtain the best design of disk resonator and feed line position in 5 GHz resonant frequency. Also, MWCNTs - PPy-CHI layers we...
متن کاملUsing proximity to compute semantic relatedness in RDF graphs
Extracting the semantic relatedness of terms is an important topic in several areas, including data mining, information retrieval and web recommendation. This paper presents an approach for computing the semantic relatedness of terns in RDF graphs based on the notion of proximity. It proposes a formal definition of proximity in terms of the set paths connecting two concept nodes, and an algorit...
متن کاملParallel Algorithms for High-Dimensional Proximity Joins
We consider the problem of parallelizing highdimensional proximity joins. We present a parallel multidimensional join algorithm based on an the epsilon-kdB tree and compare it with the more common approach of space partitioning. An evaluation of the algorithms on an IBM SP2 shared-nothing multiprocessor is presented using both synthetic and real-life datasets. We also examine the effectiveness ...
متن کاملTowards a Line-Crawling Robot Obstacle Classification System: A Rough Set Approach
The basic contribution of this paper is the presentation of two methods that can be used to design a practical robot obstacle classification system based on data mining methods from rough set theory. These methods incorporate recent advances in rough set theory related to coping with the uncertainty in making obstacle classification decisions either during the operation of a mobile robot. Obsta...
متن کامل